A lower bound for $$\chi ({\mathcal {O}}_S)$$
نویسندگان
چکیده
Abstract Let $$(S,{\mathcal {L}})$$ ( S , L ) be a smooth, irreducible, projective, complex surface, polarized by very ample line bundle $${\mathcal {L}}$$ of degree $$d > 25$$ d > 25 . In this paper we prove that $$\chi (\mathcal O_S)\ge -\frac{1}{8}d(d-6)$$ χ O ≥ - 1 8 6 The bound is sharp, and ({\mathcal {O}}_S)=-\frac{1}{8}d(d-6)$$ = if only d even, the linear system $$|H^0(S,{\mathcal {L}})|$$ | H 0 embeds S in smooth rational normal scroll $$T\subset {\mathbb {P}}^5$$ T ⊂ P 5 dimension 3, here, as divisor, linearly equivalent to $$\frac{d}{2}Q$$ 2 Q , where Q quadric on T Moreover, fact general hyperplane section $$H\in |H^0(S,{\mathcal ∈ projection curve C contained Veronese surface $$V\subseteq V ⊆ from point $$x\in V\backslash C$$ x \ C
منابع مشابه
Operator frame for $End_{mathcal{A}}^{ast}(mathcal{H})$
Frames generalize orthonormal bases and allow representation of all the elements of the space. Frames play significant role in signal and image processing, which leads to many applications in informatics, engineering, medicine, and probability. In this paper, we introduce the concepts of operator frame for the space $End_{mathcal{A}}^{ast}(mathcal{H})$ of all adjointable operator...
متن کامل*-Operator Frame for End_{mathcal{A}}^{ast}(mathcal{H})
In this paper, a new notion of frames is introduced: $ast$-operator frame as generalization of $ast$-frames in Hilbert $C^{ast}$-modules introduced by A. Alijani and M. A. Dehghan cite{Ali} and we establish some results.
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA lower bound for ...
Let A and B be two finite subsets of a field F. In this paper we provide a nontrivial lower bound for |{a + b: a ∈ A, b ∈ B, and P (a, b) 6= 0}| where P (x, y) ∈ F[x, y].
متن کاملA Lower Bound for
It is proved that there is a monotone function in AC(0) 4 which requires exponential size monotone perceptrons of depth 3. This solves the monotone version of a problem which, in the general case, would imply an oracle separation of PPPH.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rendiconti Del Circolo Matematico Di Palermo
سال: 2021
ISSN: ['1973-4409', '0009-725X']
DOI: https://doi.org/10.1007/s12215-021-00618-6